Anchor Point Thinning Using a Skeleton Based on the Euclidean Distance Transformation
نویسندگان
چکیده
Thinning is one of the most frequently used methods to know the geometrical feature of objects. It also provides the topological feature and length measurements about an object. For example, the tree structure of the bronchus is determined by using the thinned result of it. This paper presents a three dimensional thinning method which can control the quality of result concerning appearance of spurious short branches by a parameter value. This method is constructed by integrating the anchor point thinning algorithm and the skeletonization algorithm based upon the Euclidean metric. We applied the proposed method to artificial figures and a three dimensional bronchus region extracted from a real chest X-ray CT image and confirmed that the proposed method could control the number of spike branches and shrinkage of branches. Dr. Toyofumi Saito, an associate professor who was one of the most active researchers in the field of image processing in Japan and a young leader of the author’s laboratory, passed away on 26 October 2000. This paper describes one of his last works. We have lost a most reliable and most promising colleague, an experienced supervisor, and a very sincere friend. We would like to dedicate this paper to Dr. Toyofumi Saito and to all those who have shared and cherished the memories of him.
منابع مشابه
Euclidean Skeletons Using Closest Points
In this paper, we present an efficient algorithm for computing the Euclidean skeleton of an object directly from a point cloud representation on an underlying grid. The key point of this algorithm is to identify those grid points that are (approximately) on the skeleton using the closest point information of a grid point and its neighbors. The three main ingredients of the algorithm are: (1) co...
متن کاملExtraction of the Euclidean skeleton based on a connectivity criterion
The skeleton is essential for general shape representation. The commonly required properties of a skeletonization algorithm are that the extracted skeleton should be accurate; robust to noise, position and rotation; able to reconstruct the original object; and able to produce a connected skeleton in order to preserve its topological and hierarchical properties. However, the use of a discrete im...
متن کاملHierarchic Voronoi skeletons
Robust and time-efficient skeletonization of a (planar) shape, which is connectivity preserving and based on Euclidean metrics, can be achieved by first regularizing the Voronoi diagram (VD) of a shape’s boundary points, i.e., by removal of noise-sensitive parts of the tessellation and then by establishing a hierarchic organization of skeleton constituents . Each component of the VD is attribut...
متن کاملOn Reversible Skeletonization Using Anchor-Points from Distance Transforms
In many applications thinning of objects is of great interest. We here present a skeletonization algorithm that is based on the idea of iteratively thinning the distance transform of an object layer by layer until either an anchor-point is reached or the connectivity breaks. Our algorithm is general in the sense that any metric and any connectivity can be used. Also, it is based on ideas that a...
متن کاملA Fast Parallel Thinning Algorithm for the Binary Image Skeletonization
This paper investigates the skeletonization problem using parallel thinning techniques and proposes a new one-pass parallel asymmetric thinning algorithm (OPATA 8). Wu and Tsai presented a one-pass parallel asymmetric thinning algorithm (OPATA 4) that implemented 4-distance, or city block distance, skeletonization. However, city block distance is not a good approximation of Euclidean distance. ...
متن کامل